Spectral integral variation and unicyclic 3-colored digraphs with second smallest eigenvalue 1

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ela on 3-colored Digraphs with Exactly One Nonsingular Cycle

The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...

متن کامل

On colored digraphs with exactly one nonsingular cycle

The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...

متن کامل

Research Article Nonderogatory Unicyclic Digraphs

A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. Relations between nonderogatory digraphs and their automorphism groups have appeared in the literature (see [1] and [2, Theorem 5.10]). More recently, several articles (see, e.g., [1, 3–8]) address the problem of determining when certain operations between nonderogatory digraphs are again nonderogatory...

متن کامل

Fat Hoffman graphs with smallest eigenvalue greater than -3

In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing K1,2 with smallest eigenvalue greater than −3, where K1,2 is the Hoffman graph having one slim vertex and two fat vertices.

متن کامل

On unicyclic graphs whose second largest eigenvalue dose not exceed 1

Connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, all unicyclic graphs whose second largest eigenvalue does not exceed 1 have been determined. ? 2003 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2013

ISSN: 0024-3795

DOI: 10.1016/j.laa.2013.02.027